Adjacent Graph Based Vulnerability Assessment for Electrical Networks Considering Fault Adjacent Relationships Among Branches

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

VULNERABILITY ASSESSMENT OF WATER DISTRIBUTION NETWORKS: GRAPH THEORY METHOD

The main functional purpose of a water distribution network is to transport water from a source to several domestic and industrial units while at the same time satisfying various requirements on hydraulic response. All the water distribution networks perform two basic operations: firstly the water network needs to deliver adequate amounts of water to meet specific requirements, and secondly the...

متن کامل

Adjacent Vertices Fault-tolerance Fanability of Hypercube

In this paper, we introduce the concepts of fault tolerant fanability. We show that the ndimensional hypercube Qn are f-adjacent and l edges fault tolerant (n− f − l)-fanable for n ≥ 3, f + l ≤ n− 2 and l ≥ 1.

متن کامل

Graph-Based Hydraulic Vulnerability Assessment of Water Distribution Networks

Presented herein is a methodology for the seismic and hydraulic assessment of the re-liability of urban water distribution networks (UWDN) based on general seismic assessment standards, as per the American Lifelines Alliance (ALA) guidelines, localized historical records of critical risk-of-failure metrics pertaining to the specific UWDN under assessment, and hydraulic simulations using adapted...

متن کامل

A Novel Approach for Detecting Relationships in Social Networks Using Cellular Automata Based Graph Coloring

All the social networks can be modeled as a graph, where each roles as vertex and each relationroles as an edge. The graph can be show as G = [V;E], where V is the set of vertices and E is theset of edges. All social networks can be segmented to K groups, where there are members in eachgroup with same features. In each group each person knows other individuals and is in touch ...

متن کامل

Adjacent vertices fault-tolerance for bipancyclicity of hypercube∗

A bipartite graph G = (V,E) is bipancyclic if it contains the cycles of every even length from 4 to |V |. Let Fa be the set of fa pairs of adjacent vertices and Fe be the set of fe faulty edges in the n-dimensional hypercube Qn. In this paper, we will show that Qn − Fa − Fe is bipancyclic for fa + fe = n− 2.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Access

سال: 2019

ISSN: 2169-3536

DOI: 10.1109/access.2019.2926148